A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs

We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixed-endpoint path cover of G with respect to T is a set of vertex-disjoint paths P that covers the vertices of G such that the k vertices of T are all endpoints of the paths in P. The kPC problem is to find a k-fixed-endpoint path cover of G of minimum cardinality; note that, if T is empty (or, equivalently, k = 0), the stated problem coincides with the classical path cover problem. The kPC problem generalizes some path cover related problems, such as the 1HP and 2HP problems, which have been proved to be NP-complete. Note that, the complexity status of both 1HP and 2HP problems on interval graphs remains an open question [9]. In this paper, we show that the kPC problem can be solved in linear time on the class of proper interval graphs, that is, in O(n + m) time on a proper interval graph on n vertices and m edges. The proposed algorithm is simple, requires linear space, and also enables us to solve the 1HP and 2HP problems, on proper interval graphs within the same time and space complexity.